Grover search under localized dephasing
نویسندگان
چکیده
منابع مشابه
Grover search algorithm
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum state transformation, operations themselves must be unitary (reversible). Most quantum algorithms involve a series of quantum state transformations followed b...
متن کاملGrover search with pairs of trapped ions
The desired interference required for quantum computing may be modified by the wave function oscillations for the implementation of quantum algorithms[Phys.Rev.Lett.84(2000)1615]. To diminish such detrimental effect, we propose a scheme with trapped ion-pairs being qubits and apply the scheme to the Grover search. It can be found that our scheme can not only carry out a full Grover search, but ...
متن کاملReasoning about Grover ’ s Quantum Search
MICHAEL BUTLER and PIETER HARTEL Department of Electronics & Computer Science University of Southampton Southampton SO17 1BJ United Kingdom {mjb,phh}@ecs.soton.ac.uk Grover's search algorithm is designed to be executed on a quantum-mechanical computer. In this paper, the probabilistic wp-calculus is used to model and reason about Grover's algorithm. It is demonstrated that the calculus provides...
متن کاملEfficient Grover search with Rydberg blockade
We present efficient methods to implement the quantum computing Grover search algorithm using the Rydberg blockade interaction. We show that simple π -pulse excitation sequences between ground and Rydberg excited states readily produce the key conditional phase shift and inversion-about-the-mean unitary operations for the Grover search. Multi-qubit implementation schemes suitable for different ...
متن کاملGrover Search and the No-Signaling Principle.
Two of the key properties of quantum physics are the no-signaling principle and the Grover search lower bound. That is, despite admitting stronger-than-classical correlations, quantum mechanics does not imply superluminal signaling, and despite a form of exponential parallelism, quantum mechanics does not imply polynomial-time brute force solution of NP-complete problems. Here, we investigate t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2019
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.99.012339